A NEW OPTIMAL SEARCH ALGORITHM FOR THE TRANSPORTATION FLEET MAINTENANCE SCHEDULING PROBLEM

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

متن کامل

A New Approach for Finding an Optimal Solution for Grey Transportation Problem

In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...

متن کامل

A new optimal algorithm for a time-dependent scheduling problem

In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j1, . . . , jn and the processing time pi of the i-th job is given by pi = 1 + bisi, where si is the starting time of the i-th job, i = 1, . . . n. If all jobs have different and non-zero deterioration rates and bi > bj ⇒ bi ≥ bmin+1 bmin bj + 1 bmin , wh...

متن کامل

Technical Note: An opportunity cost maintenance scheduling framework for a fleet of ships: A case study

The conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. In this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. The idea is to assign a penalty cost to al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 2006

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.49.33